Creating an Intelligent System for Bankruptcy Detection: Semantic data Analysis Integrating Graph Database and Financial Ontology

In this paper, we propose a novel intelligent methodology to construct a Bankruptcy Prediction Computation Model, which is aimed to execute a company’s financial status analysis accurately. Based on the semantic data analysis and management, our methodology considers the Semantic Database System as the core of the system. It comprises three layers: an Ontology of Bankruptcy Prediction, Semantic Search Engine, and a Semantic Analysis Graph Database

A clausal resolution for extended computation tree logic ECTL

A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logics, we define a clausal resolution technique for Extended Computation Tree Logic (ECTL). The branching-time temporal logic ECTL is strictly more expressive than CTL, in allowing fairness operators. The key elements of the resolution method for ECTL, namely the clausal normal form, the concepts of step resolution and a temporal resolution, are introduced and justified with respect to this new framework. Although in developing these components we incorporate many of the techniques defined for CTL, we need novel mechanisms in order to capture fairness together with the limit closure property of the underlying tree models. We accompany our presentation of the relevant techniques by examples of the application of the temporal resolution method. Finally, we provide a correctness argument and consider future work discussing an extension of the method yet further, to the logic CTL*, the most powerful logic of this class

Discovering of System’s Invariants by Temporal Reasoning

We present a technique to handle invariants in the branching-time setting, for the specifications written in the formalism called Branching Normal Form (BNF). The language of BNF was previously used as part of the deductive clausal resolution method for a variety of branching-time logics. We show how this framework can tackle useful periodic properties, or invariants. We emphasise the potential power of this approach to the process of reconfiguration of an adaptive system where preserving invariant properties is essential

On the Expressive Power of the Normal Form for Branching-Time Temporal logics

With the emerging applications that involve complex distributed systems branching-time specifications are specifically important as they reflect dynamic and non-deterministic nature of such applications. We describe the expressive power of a simple yet powerful branching-time specification framework – branching-time normal form, which has been developed as part of clausal resolution for branching-time temporal logics. We show the encoding of B¨uchi Tree Automata in the language of the normal form, thus representing, syntactically, tree automata in a high-level way. Thus we can treat BNF as a normal form for the latter. These results enable us (1) to translate given problem specifications into the normal form and apply as a verification method a deductive reasoning technique – the clausal temporal resolution; (2) to apply one of the core components of the resolution method - the loop searching to extract, syntactically, hidden invariants in a wide range of complex temporal specifications

Proceedings of the 4th Student-STAFF Research Conference 2020 School of Computer Science and Engineering SSRC2020

This volume contains the proceedings of the 4th Student-STAFF Research Conference of the School of Computer Science and Engineering (SSRC2020). This is a traditional, annual forum which brings together, for an one-day intensive programme, established and young researchers from different areas of research, doctoral researchers, postgraduate and undergraduate alumni, and covers both traditional and emerging topics, disseminates achieved results or work in progress. During informal discussions at conference sessions, the attendees share their research findings with an open audience of academics, doctoral, postgraduate and undergraduate students. The SSRCS2020 was held on-line. The specifics of this year's conference was the participation of alumni from the Informatics Institute of Technology (IIT Sri Lanka) and Westminster International University in Tashkent (WIUT, Uzbekistan). The event met great interest - it had more than 200 on-line participants, with one session accommodating the audience of 156! The presenters whether they are established researchers or just at the start of their career, not only share their work but also gain invaluable feedback during the conference sessions. Twenty one abstracts of the Proceedings contributed by the speakers at the SSRC2020 are assembled in order of their presentation at the conference. The abstracts cover a wide spectre of topics including the development of on-line knowledge and learning repositories, data analysis, applications of machine learning in fraud detection, bankruptcy prediction, patients mortality, image synthesis, graph DB, image analysis for medical diagnostics, mobile app developments, user experience design, wide area networking, adaptive agent algorithms, plagiarism detection, process mining techniques for behavioural patterns, data mining for reablement, Cloud Computing, Networking and linguistic profiling

Tackling Incomplete System Specifcations Using Natural Deduction in the Paracomplete Setting

In many modern computer applications the significanceofspecificationbasedverificationiswellaccepted.However, when we deal with such complex processes as the integration of heterogeneous systems, parts of specification may be not known. Therefore it is important to have techniques that are able to cope with such incomplete information. An adequate formal set up is given by so called paracomplete logics, where, contrary to the classical framework, for some statements we do not have evidence to conclude if they are true or false. As a consequence, for example, the law of excluded middle is not valid. In this paper we justify how the automated proof search technique for paracomplete logic PComp can be efficiently applied to the reasoning about systems with incomplete information. Note that for many researchers, one of the core features of natural deduction, the opportunity to introduce arbitrary formulae as assumptions, has been a point of great scepticism regarding the very possibility of the automation of the proof search. Here, not only we show the contrary, but we also turned the assumptions management into an advantage showing the applicability of the proposed technique to assume-guarantee reasoning. Keywords - incomplete information, automated natural deduction, paracomplete logic, requirements engineering, assumeguarantee reasoning, component based system assembly

Search strategies for resolution in CTL-type logics: extension and complexity

A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+. In the application of the resolution rules searching for a loop is essential. In this paper we define a Depth-First technique to complement the existing Breadth-First Search and provide the complexity analysis of the developed methods. Additionally, it contains a correction in our previous presentation of loops

A clausal resolution method for branching-time logic ECTL+

We expand the applicability of the clausal resolution technique to the branching-time temporal logic ECTL_. ECTL_ is strictly more expressive than the basic computation tree logic CTL and its extension, ECTL, as it allows Boolean combinations of fairness and single temporal operators. We show that any ECTL_ formula can be translated to a normal form the structure of which was initially defined for CTL and then applied to ECTL. This enables us to apply to ECTL_ a resolution technique defined over the set of clauses. Our correctness argument also bridges the gap in the correctness proof for ECTL: we show that the transformation procedure for ECTL preserves unsatisfiability

Tuning Natural Deduction Proof Search by Analytic Methods

This paper is a result of the analysis of the efficiency of natural deduction proof search and the major weaknesses affecting it. We introduce new analytic strategies based on a new concept ”Truth Set of Support”. We present a combined proof search algorithm for classical propositional logic where a crucially new step is the guidance of the searching procedure by ”Truth sets of Support” and establish the correctness. We describe the implementation of this new search technique and exemplify its advantages on the strong version of the Pigeon Hole Principle

Influence of the temperature of electrode material on its disintegration under the action of an arc discharge in hydrogen

An analysis is made of the electrophysical processes occurring at the end surface of rod electrodes during constant and alternating arc discharge in hydrogen. Experiments are reported on the effect of surface temperature of tungsten electrodes on their erosion. The influence of activating additions of thorium oxide, the structure of the tungsten, and the gas surrounding the electrode on the specific thermal loading and the erosion of the electrodes is discussed